The Complete Weight Enumerator of Several Cyclic Codes
نویسندگان
چکیده
Cyclic codes have attracted a lot of research interest for decades. In this paper, for an odd prime p, we propose a general strategy to compute the complete weight enumerator of cyclic codes via the value distribution of the corresponding exponential sums. As applications of this general strategy, we determine the complete weight enumerator of several p-ary cyclic codes and give some examples to illustrate our results.
منابع مشابه
Complete weight enumerators of a family of three-weight linear codes
Linear codes have been an interesting topic in both theory and practice for many years. In this paper, for an odd prime p, we present the explicit complete weight enumerator of a family of p-ary linear codes constructed with defining set. The weight enumerator is an immediate result of the complete weight enumerator which shows that the codes proposed in this paper are three-weight linear codes...
متن کاملWeight enumerator of some irreducible cyclic codes
In this article, we show explicitly all possible weight enumerators for every irreducible cyclic code of length n over a finite field Fq, in the case which each prime divisor of n is also a divisor of q − 1.
متن کاملSelf-Dual Codes over the Integers Modulo 4
Michael Klemm has recently studied the conditions satisfied by the complete weight enumerator of a self-dual code over Z 4 , the ring of integers modulo 4. In the present paper we deduce analogous theorems for the ‘‘symmetrized’’ weight enumerator (which ignores the difference between + 1 and − 1 coordinates) and the Hamming weight enumerator. We give a number of examples of self-dual codes, in...
متن کاملTHE AUTOMORPHISM GROUP OF AN [l&9,8] QUATERNARY CODE
An [18,9,8] code Ce18 over GF(4) was constructed in [6] as an extended cyclic code, and Pless [9] describes the same code as an extended “Q-code”. This code is of particular interest since it is an extremal quaternary code: an [n, n/2, d] self-dual code with d = 2[n/6] + 2 ([6, p. 2951, [3, p. 2051). In the present note we give new coordinates for this code, enabling us to find a simple descrip...
متن کاملA construction of linear codes and their complete weight enumerators
Recently, linear codes constructed from defining sets have been studied extensively. They may have nice parameters if the defining set is chosen properly. Let m > 2 be a positive integer. For an odd prime p, let r = p and Tr be the absolute trace function from Fr onto Fp. In this paper, we give a construction of linear codes by defining the code CD = {(Tr(ax))x∈D : a ∈ Fr}, where D = { x ∈ Fr :...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- CoRR
دوره abs/1505.05576 شماره
صفحات -
تاریخ انتشار 2015